A finite exact algorithm to solve a dice game

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Honey Bee Algorithm To Solve Quadratic Assignment Problem

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...

متن کامل

A Game of Nontransitive Dice

We consider a two player simultaneous-move game where the two players each select any permissible n-sided die for a fixed integer n. A player wins if the outcome of his roll is greater than that of his opponent. Remarkably, for n > 3, there is a unique Nash Equilibrium in pure strategies. The unique Nash Equilibrium is for each player to throw the Standard n-sided die, where each side has a dif...

متن کامل

A Quaternion Firefly Algorithm to Solve a Multi-row Facility Layout Problem (RESEARCH NOTE)

In this paper, a quaternion firefly algorithm is utilized to solve a multi-row facility layout design problem with the objective of minimizing the total cost of transportation. A quaternion firefly algorithm takes the motion of the firefly as a quaternion one. Consequently, the solution space is explored more accurately and the answers are of higher quality. That is, the answers are considerabl...

متن کامل

Optimal minimax strategy in a dice game

Each of two players, by turns, rolls a dice several times accumulating the successive scores until he decides to stop, or he rolls an ace. When stopping, the accumulated turn score is added to the player account and the dice is given to his opponent. If he rolls an ace, the dice is given to the opponent without adding any point. In this paper we formulate this game in the framework of competiti...

متن کامل

A Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem

Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. Accordingly, the population of elderlies has been increased. By another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. Hence, Home Health Care (HHC) operations including a set of nurses and patients have been develope...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2016

ISSN: 0021-9002,1475-6072

DOI: 10.1017/jpr.2015.11